Dynamic Complexity under Definable Changes
نویسندگان
چکیده
This paper studies dynamic complexity under definable change operations in the DynFO framework by Patnaik and Immerman. It is shown that for changes definable by parameter-free firstorder formulas, all (uniform) AC1 queries can be maintained by first-order dynamic programs. Furthermore, many maintenance results for single-tuple changes are extended to more powerful change operations: (1) The reachability query for undirected graphs is first-order maintainable under single tuple changes and first-order defined insertions, likewise the reachability query for directed acyclic graphs under quantifier-free insertions. (2) Context-free languages are first-order maintainable under Σ1-defined changes. These results are complemented by several inexpressibility results, for example, that the reachability query cannot be maintained by quantifier-free programs under definable, quantifier-free deletions. 1998 ACM Subject Classification F.4.1. Mathematical Logic
منابع مشابه
Definable isomorphism problem
We investigate the isomorphism problem in the setting of definable sets (equivalent to sets with atoms): given two definable relational structures, are they related by a definable isomorphism? Under mild assumptions on the underlying structure of atoms, we prove decidability of the problem. The core result is parameter-elimination: existence of an isomorphism definable with parameters implies e...
متن کاملThe Effect of Tax Complexity on Economic Growth: A Dynamic Panel Data Model for Selected Developed Countries
One of the most important concerns of economists is identification of the economic growth determinants. Meanwhile, institutional factors are of important ones. This paper aims to empirically investigate the effect of tax complexity, as a determinant institutional factor of economic growth in 42 relatively developed economies during 2008-2016. The tax complexity variables include: the time spent...
متن کاملThe Descriptive Complexity of Parity Games
We study the logical definablity of the winning regions of parity games. For games with a bounded number of priorities, it is wellknown that the winning regions are definable in the modal μ-calculus. Here we investigate the case of an unbounded number of priorities, both for finite game graphs and for arbitrary ones. In the general case, winning regions are definable in guarded second-order log...
متن کاملFrequency Response Analysis of a Capacitive Micro-beam Resonator Considering Residual and Axial Stresses and Temperature Changes Effects
This paper presents a study on the frequency response of a capacitive micro-beam resonator under various applied stresses. The governing equation whose solution holds the answer to all our questions about the mechanical behavior is the nonlinear electrostatic equation. Due to the nonlinearity and complexity of the derived equation analytical solution are not generally available; therefore, the ...
متن کاملFunctions Definable by Arithmetic Circuits
An arithmetic circuit (McKenzie and Wagner [6]) is a labelled, directed graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this paper, we consider the definability of functions by means of arithmetic circuits. We prove two negative results: the first shows, roughly, that a function is not circuit-definable if it has an infinite r...
متن کامل